从符号学出发的城市家具设计

本文从符号学的角度来分析城市家具的设计，是对设计如何满足现代社会发展需求的探索，从功能到符号，从符号到设计，设计不再是绘画的附属，而是建立符号系统的过程．     

关于自正交的整表代数码

整表代数是群代数的推广，它的理想是群代数码的推广．本文给出了整表代数的单边理想是自正交理想的必要充分条件．     

A Lower Bound on the Greedy Weights of Product Codes

A greedy 1-subcode is a one-dimensional subcode of minimum (support) weight. A greedy r-subcode is an r-dimensional subcode with minimum support weight under the constraint that it contain a greedy (r - 1)-subcode. The r-th greedy weight e _r is the support weight of a greedy r-subcode. The greedy weights are related to the weight hierarchy. We use recent results on the weight hierarchy of product codes to develop a lower bound on the greedy weights of product codes.     

On the Minimum Weight of Codes over F5 Constructed from Certain Conference Matrices

In this paper, codes over F₅ with parameters [36, 18, 12], [48, 24, 15], [60, 30, 18], [64, 32, 18] and [76, 38, 21] which improve the previously known bounds on the minimum weight for linear codes over F₅ are constructed from conference matrices. Through shortening and truncating, the above codes give numerous new codes over F₅ which improve the previously known bounds on minimum weights.     

Failed disk recovery in double erasure RAID arrays

Reliability is a major concern in the design of large disk arrays. In this paper, we examine the effect of encountering more failures than that for which the RAID array was initially designed. Erasure codes are incorporated to enable system recovery from a specified number of disk erasures, and strive beyond that threshold to recover the system as frequently, and as thoroughly, as is possible. Erasure codes for tolerating two disk failures are examined. For these double erasure codes, we establish a correspondence between system operation and acyclicity of its graph model. For the most compact double erasure code, the full 2-code, this underlies an efficient algorithm for the computation of system operation probability (all disks operating or recoverable).When the system has failed, some disks are nonetheless recoverable. We extend the graph model to determine the probability that d disks have failed, a of which are recoverable by solving one linear equation, b of which are further recoverable by solving systems of linear equations, and d−a−b of which cannot be recovered. These statistics are efficiently calculated for the full 2-code by developing a three variable ordinary generating function whose coefficients give the specified values. Finally, examples are given to illustrate the probability that an individual disk can be recovered, even when the system is in a failed state.     

A T-matrix method and computer code for randomly oriented, axially symmetric coated scatterers

A computer code is described for the calculation of light-scattering properties of randomly oriented, axially symmetric coated particles, in the framework of the T-matrix theory. The underlying mathematical background is outlined briefly and convergence procedures are discussed. After outlining the input-output interaction between user and code, benchmark results are presented for two distinct shapes: coated, centered spheroids and offset coated spheres.     

便携式条形码阅读器的设计

本设计为一种便携式条形码阅读译码器（简称阅读器），它采用ＩＮＴＥＬ８０３１ＣＰＵ微处理器为主芯片，辅以其它大规模集成电路芯片，构成一智能化系统，阅读及识别采用Ｃｏｄｅ３９码编制的条形码，并能完成条形码信息的存储、数目统计及与微机进行串行通信功能。     

Symplectic spread-based generalized Kerdock codes

Kerdock codes (Kerdock, Inform Control 20:182–187, 1972) are a well-known family of non-linear binary codes with good parameters admitting a linear presentation in terms of codes over the ring (see Nechaev, Diskret Mat 1:123–139, 1989; Hammons et al., IEEE Trans Inform Theory 40:301–319, 1994). These codes have been generalized in different directions: in Calderbank et al. (Proc Lond Math Soc 75:436–480, 1997) a symplectic construction of non-linear binary codes with the same parameters of the Kerdock codes has been given. Such codes are not necessarily equivalent. On the other hand, in Kuzmin and Nechaev (Russ Math Surv 49(5), 1994) the authors give a family of non-linear codes over the finite field F of q = 2 ^l elements, all of them admitting a linear presentation over the Galois Ring R of cardinality q ² and characteristic 2². The aim of this article is to merge both approaches, obtaining in this way new families of non-linear codes over F that can be presented as linear codes over the Galois Ring R. The construction uses symplectic spreads.      

Generating 2-Gray codes for ballot sequences in constant amortized time

We present a simple algorithm that generates a cyclic 2-Gray code for ballot sequences. The algorithm generates each ballot sequence in constant amortized time using a linear amount of space. This is the first known cyclic 2-Gray code for ballot sequences that achieves this time bound. In addition, the algorithm can be easily modified to output ballot sequences in binary reflected Gray code order in constant amortized time per string using a linear amount of space.     

陆基无线扩频定位系统中伪随机码设计

讨论了无线扩频定位系统的关键技术之一——扩频码的设计与实现。首先从实验的角度基于Logistic映射，分析了其所生成的混沌序列的部分相关特性及平衡性，给出了计算机仿真结果；最后从工程角度给出了易于实现的平衡Gold码的设计方法。